Project-Team:PARSIFAL

Project-Team Parsifal

Members

Overall Objectives

Main themes

Research Program

General overview
Inductive and co-inductive reasoning
Developing a foundational approach to defining proof evidence
Deep inference
Proof nets and atomic flows
Cost Models and Abstract Machines for Functional Programs

Application Domains

Integrating a model checker and a theorem prover
Implementing trusted proof checkers
Trustworthy implementations of theorem proving techniques

Highlights of the Year

New Software and Platforms

Abella
Bedwyr
Checkers
Psyche

New Results

Linear rewriting systems for Boolean logic
Non-crossing Tree Realizations of Ordered Degree Sequences
Focusing for Nested Sequents
Combining inference systems: a generalization of Nelson-Oppen and MCSAT
Linear lambda terms as invariants of rooted trivalent maps
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine
Towards a link between CPS and focusing
Proof Checking and Logic Programming
Proof Certificates for First-Order Equational Logic
Extended Pattern Unification
Focused proofs for modal logics
Preserving differential privacy under finite-precision semantics
Certification of Prefixed Tableau Proofs for Modal Logic
Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers
Open Call-by-Value
A Reasonable Abstract Machine for the Strong λ-Calculus
Space-efficient Acyclicity Constraints
Exp-log normal form of types and the axioms for η-equality of the λ-calculus with sums
Invertible-rule-free sequent calculi and an intuitionistic arithmetical hierarchy

Partnerships and Cooperations

European Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries

Bibliography

Major publications
Publications of the year
References in notes

Inria | Raweb 2016 | Presentation of the Project-Team PARSIFAL | PARSIFAL Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

Towards a Substitution Tree Based Index for Higher-order Resolution Theorem Provers

Participant : Tomer Libal.

First-order resolution theorem provers depend on efficient data structures for redundancy elimination. These data structures do not exist for higher-order resolution theorem provers. In [32] we discuss a new approach to this problem. (Joint work with Alexander Steen).

Previous |

Home | Next next